<!DOCTYPE html>
<html>

<head>
<meta charset="UTF-8">

<title> 提交记录 4154 - Judge Duck Online </title>

<link rel="icon" type="image/png" href="/images/judgeduck-logo-small.png" />

<script src="/libs/js/jquery-3.2.1.min.js"></script>

<!-- Latest compiled and minified CSS -->
<link rel="stylesheet" href="/libs/css/bootstrap.min.css" />

<!-- Latest compiled and minified JavaScript -->
<script src="/libs/js/bootstrap.min.js"></script>

<link rel="stylesheet" type="text/css" href="/css/main.css" />
<link rel="stylesheet" href="/css/non-responsive.css" type="text/css" />

<script src="/js/md5.js"></script>
<script src="/js/judgeduck.js"></script>

<script type="text/x-mathjax-config">
	MathJax.Hub.Config({
		showProcessingMessages: false,
		tex2jax: {
			inlineMath: [["$", "$"], ["\\\\(", "\\\\)"]],
			processEscapes:true
		},
		menuSettings: {
			zoom: "Hover"
		}
	});
</script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.css">
<script src="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.js"></script>

</head>

<body onload="">

<!-- Fixed navbar -->
<nav class="navbar navbar-default" role="navigation" style="background-color: #eeeeee">
	<div class="container">
		<div class="navbar-header">
			<div class="navbar-brand">
				<a href="/">
					<img src="/images/judgeduck-logo.png" width="40px" height="40px" style="margin:-10px" />
				</a>
			</div>
			<font class="navbar-brand">
				Judge Duck Online
			</font>
		</div>
		<div class="navbar-collapse collapse">
			<ul class="nav navbar-nav">
				<li class="nav-item">
					<a class="nav-link" href="/index/index.html"> 首页 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/problems/index.html"> 题目列表 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/submissions/index.html"> 提交记录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/blogs/index.html"> 博客 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/faq/index.html"> FAQ </a>
				</li>
			</ul>
			<ul class="nav navbar-nav navbar-right">
				<li class="nav-item">
					<a class="nav-link" href="/user/login/index.html"> 登录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/user/register/index.html"> 注册 </a>
				</li>
			</ul>
		</div><!--/.nav-collapse -->
	</div>
</nav>




<div id="main_div" class="container" style="padding-left: 25px; padding-right: 25px">
	<h2> 提交记录 4154 </h2>
	<hr />
	
	<div class="row">
		<div class="col-xs-12">
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-2"> 用户 </th>
					<th class="col-xs-3"> 题目 </th>
					<th class="col-xs-2"> 状态 </th>
					<th class="col-xs-1"> 得分 </th>
					<th class="col-xs-1"> 用时 </th>
					<th class="col-xs-1"> 内存 </th>
					<th class="col-xs-1"> 语言 </th>
					<th class="col-xs-1"> 代码长度 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> <a href='/user/profile/jhdjames37/index.html'> jhdjames37 </a> </td>
<td> <a href='/problem/noi18c/index.html'> noi18c. 【NOI2018】你的名字 </a> </td>
<td> Accepted </td>
<td> 100 </td>
<td style='font-size:13px'> 1.311 s </td>
<td style='font-size:13px'> 478 MB + 660 KB </td>
<td style='font-size:13px'> C++ </td>
<td style='font-size:13px'> 9.69 KB </td>
				</tr>
			</table>
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-6"> 提交时间 </th>
					<th class="col-xs-6"> 评测时间 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> 2018-07-18 21:42:22 </td>
<td style='font-size:13px'> 2019-01-19 02:39:50 </td>
				</tr>
			</table>
			<link rel="stylesheet" href="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/styles/tomorrow.min.css">
			<script src="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/highlight.min.js"></script>
			<script>hljs.initHighlightingOnLoad();</script>
			<div class="row">
				<label for="code"> 代码 </label>
				<pre style="background-color:white"><code class="cpp">#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;
const int MAXN = 1e6 + 10;

char s[MAXN], t[MAXN];
int n, m, q;
namespace solver1 {
  namespace sam {
    const int SIZE = 2e6;
    struct Node {
      int tranc[26];
      int fa, dep;
      int ver, cnt, to;
    }tree[SIZE];
    int root, cnt, tail, tot;
    int tot_time;
    std::vector &lt;int&gt; pts;
    Node backup[MAXN];
    void insert(int x) {
      int p = tail, np = ++cnt;
      tree[np].dep = tree[p].dep + 1;
      for (; p &amp;&amp; !tree[p].tranc[x]; p = tree[p].fa) tree[p].tranc[x] = np;
      if (!p) {
        tree[np].fa = root;
      } else {
        int q = tree[p].tranc[x];
        if (tree[q].dep == tree[p].dep + 1) {
          tree[np].fa = q;
        } else {
          int nq = ++cnt;
          tree[nq] = tree[q];
          tree[nq].dep = tree[p].dep + 1;
          tree[q].fa = tree[np].fa = nq;
          for (; p &amp;&amp; tree[p].tranc[x] == q; p = tree[p].fa) tree[p].tranc[x] = nq;
        }
      }
      tail = np;

    }
    void init() {
      tail = root = cnt = 1;
      
      for (int i = 1; i &lt;= n; i++) {
        insert(s[i] - &#x27;a&#x27;);
      }

      for (int i = 1; i &lt;= cnt; i++) {
        tree[i].cnt = 1;
        tree[i].to = i;
      }
      tot = cnt;
      std::copy(tree + 1, tree + cnt + 1, backup + 1);
    }
    void copy_node(int &amp;x) {
      return;
      if (tree[x].ver != tot_time) {
        int u = ++cnt;
        tree[u] = tree[x];
        tree[u].ver = tot_time;
        tree[u].to = u;
        
        tree[x].ver = tot_time;
        tree[x].to = u;
        
        
        if (x == root) {
          root = u;
        }
        x = u;
      } else {
        x = tree[x].to;
      }
    }
    
    int newnode() {
      int u = ++cnt;
      memset(tree + u, 0, sizeof tree[u]);
      tree[u].ver = tot_time;
      pts.push_back(u);
      return u;
    }
    void insert2(int x) {
      int p = tail, np;
      if (!tree[p].tranc[x]) {
        np = newnode();
      } else {
        np = tree[p].tranc[x];

        if (tree[np].dep != tree[p].dep + 1) {
          copy_node(np);
          int nq = newnode();
          tree[nq] = tree[np];
          tree[nq].dep = tree[p].dep + 1;
          tree[np].fa = nq;
          for (; p &amp;&amp; tree[p].tranc[x] == np; p = tree[p].fa) {
            copy_node(p);
            tree[p].tranc[x] = nq;
          }
         
          tail = nq;
        } else {
          tail = np;
        }
        return;
      }
      
      tree[np].dep = tree[p].dep + 1;
      for (; p &amp;&amp; !tree[p].tranc[x]; p = tree[p].fa) {
        copy_node(p);
        tree[p].tranc[x] = np;
      }
      
      if (!p) {
        tree[np].fa = root;
      } else {
        int q = tree[p].tranc[x];
        if (tree[q].dep == tree[p].dep + 1) {
          tree[np].fa = q;
        } else {
          int nq = newnode();
          tree[nq] = tree[q];
          tree[nq].dep = tree[p].dep + 1;
          copy_node(q);
          tree[q].fa = tree[np].fa = nq;
          for (; p &amp;&amp; tree[p].tranc[x] == q; p = tree[p].fa) {
            copy_node(p);
            tree[p].tranc[x] = nq;
          }
        }
      }
      tail = np;
    }
    
    long long query() {
      ++tot_time;
      cnt = tot;
      root = 1;
      tail = root;
      std::copy(backup + 1, backup + cnt + 1, tree + 1);

      pts.clear();
      
      for (int i = 1; i &lt;= m; i++) {
        insert2(t[i] - &#x27;a&#x27;);
      }

      long long ans = 0;
      for (int i = 0; i &lt; (int) pts.size(); i++) {

        int k = pts[i];
        if (!tree[k].cnt) {
          ans += tree[k].dep - tree[tree[k].fa].dep;
        }
      }


      return ans;
    }
    
  }
  void main() {
    sam::init();
    while(q--) {
      int l, r;
      scanf(&quot;%s%d%d&quot;, t + 1, &amp;l, &amp;r);
      m = strlen(t + 1);
      printf(&quot;%lld\n&quot;, sam::query());
    }
  }
}
namespace solver_std {
  namespace seg_tree {
    const int SIZE = 1e7;
    struct Node {
      int ls, rs;
      int cnt;
    }tree[SIZE];
    int root[MAXN], cnt;
    void build(int &amp;node, int l, int r) {
      node = ++cnt;
      if (l == r) return;
      int mid = (l + r) &gt;&gt; 1;
      build(tree[node].ls, l, mid);
      build(tree[node].rs, mid + 1, r);
    }
    void init() { build(root[0], 1, n); }
    int p;
    int ql, qr, ans;
    void _modify(int &amp;node, int pre, int l, int r) {
      node = ++cnt;
      tree[node] = tree[pre];
      tree[node].cnt++;
      if (l == r) return;
      int mid = (l + r) &gt;&gt; 1;
      if (p &lt;= mid) _modify(tree[node].ls, tree[pre].ls, l, mid);
      else _modify(tree[node].rs, tree[pre].rs, mid + 1, r);
    }
    void modify(int ver, int pos) {
      p = pos;
      _modify(root[ver], root[ver - 1], 1, n);
    }
    void _query(int lnode, int rnode, int l, int r) {
      if (ql &lt;= l &amp;&amp; r &lt;= qr) {
        ans += tree[rnode].cnt - tree[lnode].cnt;
        return;
      }
      int mid = (l + r) &gt;&gt; 1;
      if (ql &lt;= mid) _query(tree[lnode].ls, tree[rnode].ls, l, mid);
      if (qr &gt; mid) _query(tree[lnode].rs, tree[rnode].rs, mid + 1, r);
    }
    int query(int a, int b, int l, int r) {
      if (l &gt; r) return 0;
      ql = l, qr = r; ans = 0;
      _query(root[b], root[a - 1], 1, n);
      return ans;
    }
  }
  namespace sam2 {
    const int SIZE = MAXN &lt;&lt; 1;
    struct Node {
      int tranc[26];
      int fa, dep;
      int val;
    }tree[SIZE];
    int root, cnt, tail;
    void init() {
      root = cnt = tail = 1;
      memset(tree + 1, 0, sizeof (tree[1]));
    }
    void insert(int x, int v) {
      //fprintf(stderr, &quot;%d %d\n&quot;, x, v);
      
      int p = tail, np = ++cnt;
      memset(tree + np, 0, sizeof (tree[np]));
      tree[np].dep = tree[p].dep + 1;
      for (; p &amp;&amp; !tree[p].tranc[x]; p = tree[p].fa) tree[p].tranc[x] = np;
      if (!p) {
        tree[np].fa = root;
      } else {
        int q = tree[p].tranc[x];
        if (tree[q].dep == tree[p].dep + 1) {
          tree[np].fa = q;
        } else {
          int nq = ++cnt;
          tree[nq] = tree[q];
          tree[nq].dep = tree[p].dep + 1;
          tree[nq].val = 0;
          tree[q].fa = tree[np].fa = nq;
          for (; p &amp;&amp; tree[p].tranc[x] == q; p = tree[p].fa) tree[p].tranc[x] = nq;
        }
      }
      tail = np;
      tree[np].val = v;
    }
    long long query() {
      static int tot[SIZE];
      for (int i = 0; i &lt;= m; i++) tot[i] = 0;
      for (int i = 1; i &lt;= cnt; i++) {
        tot[tree[i].dep]++;
      }
      static int seq[SIZE];
      for (int i = 1; i &lt;= m; i++) tot[i] += tot[i - 1];
      
      for (int i = 1; i &lt;= cnt; i++) {
        seq[tot[tree[i].dep]--] = i; 
      }

      for (int i = cnt; i &gt;= 1; i--) {
        int x = seq[i];
        tree[tree[x].fa].val = std::max(tree[tree[x].fa].val, tree[x].val);
      }

      long long ans = 0;
      for (int i = 2; i &lt;= cnt; i++) {
        if (tree[i].dep &lt;= tree[i].val) continue;
        ans += tree[i].dep - std::max(tree[tree[i].fa].dep, tree[i].val);
      }

      return ans;
    }

  }
  namespace sam {
    const int SIZE = MAXN &lt;&lt; 1;
    struct Node {
      int tranc[26];
      std::vector &lt;int&gt; son;
      int fa, dep;
      int pos;
    }tree[SIZE];
    int root, cnt, tail;
    void insert(int x, int v) {
      
      int p = tail, np = ++cnt;
      
      
      tree[np].dep = tree[p].dep + 1;
      for (; p &amp;&amp; !tree[p].tranc[x]; p = tree[p].fa) tree[p].tranc[x] = np;
      if (!p) {
        tree[np].fa = root;
      } else {
        int q = tree[p].tranc[x];
        if (tree[q].dep == tree[p].dep + 1) {
          tree[np].fa = q;
        } else {
          int nq = ++cnt;
          tree[nq] = tree[q];
          tree[nq].dep = tree[p].dep + 1;
          tree[nq].pos = 0;
          tree[q].fa = tree[np].fa = nq;
          for (; p &amp;&amp; tree[p].tranc[x] == q; p = tree[p].fa) tree[p].tranc[x] = nq;
        }
      }
      tail = np;
      tree[np].pos = v;
    }
    int clk;
    int st[MAXN], en[MAXN];
    void dfs(int u) {
      //fprintf(stderr, &quot;%d\n&quot;, u);
      st[u] = clk + 1;
      if (tree[u].pos) {
        ++clk;
        seg_tree::modify(clk, tree[u].pos);
      }
      for (int i = 0; i &lt; (int) tree[u].son.size(); i++) {
        dfs(tree[u].son[i]);
      }
      en[u] = clk;
    }
    void init() {
      root = cnt = tail = 1;
      
      for (int i = 1; i &lt;= n; i++) {
        insert(s[i] - &#x27;a&#x27;, i);
      }
      for (int i = 2; i &lt;= cnt; i++) {
        tree[tree[i].fa].son.push_back(i);
      }

      seg_tree::init();
      
      dfs(1);
    }
    long long work(int l, int r) {
      int cur = 1;
      static int bnd[MAXN];
      sam2::init();
      int dep = 0;
      for (int i = 1; i &lt;= m; i++) {
        int x = t[i] - &#x27;a&#x27;;
        for (; cur &amp;&amp; !tree[cur].tranc[x]; cur = tree[cur].fa, dep = tree[cur].dep);
        if (!cur) {
          cur = 1; bnd[i] = 0; dep = 0;
        } else {
          dep++;
          cur = tree[cur].tranc[x];
          while(1) {
            bool flag = 0;
            for (int val = std::min(tree[cur].dep, dep); val &gt; tree[tree[cur].fa].dep; val--) {
              if (seg_tree::query(st[cur], en[cur], l + val - 1, r)) {
                bnd[i] = val;
                flag = 1;
                break;
              }
            }
            if (flag) break;
            cur = tree[cur].fa;
            dep = tree[cur].dep;
            if (!cur) {
              cur = 1;
              bnd[i] = 0;
              break;
            }
          }
        }
        //fprintf(stderr, &quot;%d %d %d  &quot;, bnd[i], cur, dep);
        sam2::insert(x, bnd[i]);
      }

      return sam2::query();
    }
  }
  void main() {
    sam::init();
    while(q--) {
      int l, r;
      scanf(&quot;%s%d%d&quot;, t + 1, &amp;l, &amp;r);
      m = strlen(t + 1);
      printf(&quot;%lld\n&quot;, sam::work(l, r));
    }
  }
}

int main() {
  //freopen(&quot;name.in&quot;, &quot;r&quot;, stdin);
  //freopen(&quot;name.out&quot;, &quot;w&quot;, stdout);
  scanf(&quot;%s&quot;, s + 1);
  n = strlen(s + 1);
  scanf(&quot;%d&quot;, &amp;q);
  solver_std::main();
  
}
</code></pre>
				<br />
				
				<label for="result"> 评测结果 </label><div class="row"><div class="col-xs-12"><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Compilation</b></td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">Compile OK</td><td class="col-xs-2" style="vertical-align:middle">Score: N/A</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_1" aria-expanded="false" aria-controls="detail_1">显示更多</a></td></tr></table></div><div class="collapse" id="detail_1"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>Compiling...
Compile success!
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #1</b></td><td class="col-xs-2" style="vertical-align:middle">53.988 ms</td><td class="col-xs-2" style="vertical-align:middle">244 MB + 308 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_2" aria-expanded="false" aria-controls="detail_2">显示更多</a></td></tr></table></div><div class="collapse" id="detail_2"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 53.988415
mem_kb = 250164
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #2</b></td><td class="col-xs-2" style="vertical-align:middle">55.078 ms</td><td class="col-xs-2" style="vertical-align:middle">244 MB + 448 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_3" aria-expanded="false" aria-controls="detail_3">显示更多</a></td></tr></table></div><div class="collapse" id="detail_3"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 55.077916
mem_kb = 250304
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #3</b></td><td class="col-xs-2" style="vertical-align:middle">55.146 ms</td><td class="col-xs-2" style="vertical-align:middle">244 MB + 452 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_4" aria-expanded="false" aria-controls="detail_4">显示更多</a></td></tr></table></div><div class="collapse" id="detail_4"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 55.145960
mem_kb = 250308
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #4</b></td><td class="col-xs-2" style="vertical-align:middle">124.734 ms</td><td class="col-xs-2" style="vertical-align:middle">244 MB + 904 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_5" aria-expanded="false" aria-controls="detail_5">显示更多</a></td></tr></table></div><div class="collapse" id="detail_5"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 124.734222
mem_kb = 250760
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #5</b></td><td class="col-xs-2" style="vertical-align:middle">121.945 ms</td><td class="col-xs-2" style="vertical-align:middle">244 MB + 900 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_6" aria-expanded="false" aria-controls="detail_6">显示更多</a></td></tr></table></div><div class="collapse" id="detail_6"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 121.944822
mem_kb = 250756
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #6</b></td><td class="col-xs-2" style="vertical-align:middle">815.869 ms</td><td class="col-xs-2" style="vertical-align:middle">478 MB + 516 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_7" aria-expanded="false" aria-controls="detail_7">显示更多</a></td></tr></table></div><div class="collapse" id="detail_7"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 815.868847
mem_kb = 489988
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #7</b></td><td class="col-xs-2" style="vertical-align:middle">816.054 ms</td><td class="col-xs-2" style="vertical-align:middle">478 MB + 660 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_8" aria-expanded="false" aria-controls="detail_8">显示更多</a></td></tr></table></div><div class="collapse" id="detail_8"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 816.053754
mem_kb = 490132
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #8</b></td><td class="col-xs-2" style="vertical-align:middle">172.871 ms</td><td class="col-xs-2" style="vertical-align:middle">272 MB + 820 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_9" aria-expanded="false" aria-controls="detail_9">显示更多</a></td></tr></table></div><div class="collapse" id="detail_9"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 172.871235
mem_kb = 279348
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #9</b></td><td class="col-xs-2" style="vertical-align:middle">203.997 ms</td><td class="col-xs-2" style="vertical-align:middle">272 MB + 544 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_10" aria-expanded="false" aria-controls="detail_10">显示更多</a></td></tr></table></div><div class="collapse" id="detail_10"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 203.997350
mem_kb = 279072
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #10</b></td><td class="col-xs-2" style="vertical-align:middle">323.714 ms</td><td class="col-xs-2" style="vertical-align:middle">303 MB + 580 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_11" aria-expanded="false" aria-controls="detail_11">显示更多</a></td></tr></table></div><div class="collapse" id="detail_11"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 323.714080
mem_kb = 310852
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #11</b></td><td class="col-xs-2" style="vertical-align:middle">413.692 ms</td><td class="col-xs-2" style="vertical-align:middle">303 MB + 260 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_12" aria-expanded="false" aria-controls="detail_12">显示更多</a></td></tr></table></div><div class="collapse" id="detail_12"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 413.691938
mem_kb = 310532
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #12</b></td><td class="col-xs-2" style="vertical-align:middle">506.436 ms</td><td class="col-xs-2" style="vertical-align:middle">334 MB + 896 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_13" aria-expanded="false" aria-controls="detail_13">显示更多</a></td></tr></table></div><div class="collapse" id="detail_13"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 506.436081
mem_kb = 342912
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #13</b></td><td class="col-xs-2" style="vertical-align:middle">646.652 ms</td><td class="col-xs-2" style="vertical-align:middle">334 MB + 452 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_14" aria-expanded="false" aria-controls="detail_14">显示更多</a></td></tr></table></div><div class="collapse" id="detail_14"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 646.651655
mem_kb = 342468
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #14</b></td><td class="col-xs-2" style="vertical-align:middle">675.852 ms</td><td class="col-xs-2" style="vertical-align:middle">366 MB + 948 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_15" aria-expanded="false" aria-controls="detail_15">显示更多</a></td></tr></table></div><div class="collapse" id="detail_15"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 675.851791
mem_kb = 375732
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #15</b></td><td class="col-xs-2" style="vertical-align:middle">897.379 ms</td><td class="col-xs-2" style="vertical-align:middle">366 MB + 472 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_16" aria-expanded="false" aria-controls="detail_16">显示更多</a></td></tr></table></div><div class="collapse" id="detail_16"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 897.379229
mem_kb = 375256
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #16</b></td><td class="col-xs-2" style="vertical-align:middle">853.999 ms</td><td class="col-xs-2" style="vertical-align:middle">399 MB + 36 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_17" aria-expanded="false" aria-controls="detail_17">显示更多</a></td></tr></table></div><div class="collapse" id="detail_17"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 853.998994
mem_kb = 408612
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #17</b></td><td class="col-xs-2" style="vertical-align:middle">1.153 s</td><td class="col-xs-2" style="vertical-align:middle">398 MB + 712 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_18" aria-expanded="false" aria-controls="detail_18">显示更多</a></td></tr></table></div><div class="collapse" id="detail_18"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1152.905549
mem_kb = 408264
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #18</b></td><td class="col-xs-2" style="vertical-align:middle">887.928 ms</td><td class="col-xs-2" style="vertical-align:middle">312 MB + 528 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_19" aria-expanded="false" aria-controls="detail_19">显示更多</a></td></tr></table></div><div class="collapse" id="detail_19"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 887.928245
mem_kb = 320016
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #19</b></td><td class="col-xs-2" style="vertical-align:middle">1.01 s</td><td class="col-xs-2" style="vertical-align:middle">340 MB + 752 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_11" aria-expanded="false" aria-controls="detail_11">显示更多</a>
<a style="display:inline-block;background-color:;color:#fff;padding:2px 5px;font-family:arial;font-size:12px;font-weight:bold;" href="http://www.iis7.com" target="_blank" class="88f53fb307e84682ac82b375ed16f653">iis7站长之家</a></td></tr></table></div><div class="collapse" id="detail_20"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1010.142787
mem_kb = 348912
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #20</b></td><td class="col-xs-2" style="vertical-align:middle">1.166 s</td><td class="col-xs-2" style="vertical-align:middle">369 MB + 848 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_21" aria-expanded="false" aria-controls="detail_21">显示更多</a></td></tr></table></div><div class="collapse" id="detail_21"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1165.894510
mem_kb = 378704
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #21</b></td><td class="col-xs-2" style="vertical-align:middle">1.221 s</td><td class="col-xs-2" style="vertical-align:middle">399 MB + 20 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_22" aria-expanded="false" aria-controls="detail_22">显示更多</a></td></tr></table></div><div class="collapse" id="detail_22"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1221.467963
mem_kb = 408596
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #22</b></td><td class="col-xs-2" style="vertical-align:middle">1.311 s</td><td class="col-xs-2" style="vertical-align:middle">399 MB + 28 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_23" aria-expanded="false" aria-controls="detail_23">显示更多</a></td></tr></table></div><div class="collapse" id="detail_23"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1310.616904
mem_kb = 408604
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #23</b></td><td class="col-xs-2" style="vertical-align:middle">1.31 s</td><td class="col-xs-2" style="vertical-align:middle">399 MB + 8 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_24" aria-expanded="false" aria-controls="detail_24">显示更多</a></td></tr></table></div><div class="collapse" id="detail_24"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1310.433091
mem_kb = 408584
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #24</b></td><td class="col-xs-2" style="vertical-align:middle">1.262 s</td><td class="col-xs-2" style="vertical-align:middle">399 MB + 12 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_25" aria-expanded="false" aria-controls="detail_25">显示更多</a></td></tr></table></div><div class="collapse" id="detail_25"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1261.916755
mem_kb = 408588
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #25</b></td><td class="col-xs-2" style="vertical-align:middle">1.228 s</td><td class="col-xs-2" style="vertical-align:middle">399 MB + 12 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 4</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_26" aria-expanded="false" aria-controls="detail_26">显示更多</a></td></tr></table></div><div class="collapse" id="detail_26"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1227.859067
mem_kb = 408588
Correct Answer
</textarea></div></div></div></div>
			</div>
		</div>
	</div>

	<hr />
	
	<div class="row">
		<p style="text-align: center; color: #888">
			Judge Duck Online | 评测鸭在线 <br />
			Server Time: 2019-08-02 17:15:39 | Loaded in 18 ms | <a href="/status/index.html"> Server Status </a> <br />
			个人娱乐项目，仅供学习交流使用
		</p>
	</div>
</div>

</body>

</html>
